منابع مشابه
Input-Driven Stack Automata
We introduce and investigate input-driven stack automata, which are a generalization of input-driven pushdown automata that recently became popular under the name visibly pushdown automata. Basically, the idea is that the input letters uniquely determine the operations on the pushdown store. This can nicely be generalized to stack automata by further types of input letters which are responsible...
متن کاملA Note on the P-completeness of Deterministic One-way Stack Language
The membership problems of both stack automata and nonerasing stack automata are shown to be complete for polynomial time.
متن کاملOn Infinite Words Determined by Stack Automata
We characterize the infinite words determined by one-way stack automata. An infinite language L determines an infinite word α if every string in L is a prefix of α. If L is regular or context-free, it is known that α must be ultimately periodic. We extend this result to the class of languages recognized by one-way nondeterministic checking stack automata (1-NCSA). We then consider stronger clas...
متن کاملAverage Stack Cost of Büchi Pushdown Automata
We study the average stack cost of Büchi pushdown automata (Büchi PDA). We associate a non-negative price with each stack symbol and define the cost of a stack as the sum of costs of all its elements. We introduce and study the average stack cost problem (ASC), which asks whether there exists an accepting run of a given Büchi PDA such that the long-run average of stack costs is below some given...
متن کاملFrom Multi to Single Stack Automata
Verification of concurrent programs modelled as multi-stack machines is an active research area. Recently decidability/complexity results have been established for powerful models such as bounded-phase visibly pushdown automata (BVMPA) [16] and ordered multi-pushdown automata (OMPA) [1]. However, the proofs of these results are quite complex and are based on different techniques and concepts fo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1967
ISSN: 0022-0000
DOI: 10.1016/s0022-0000(67)80013-8